Analysis of greedy algorithms on graphs with bounded degrees
نویسنده
چکیده
We give a general result on the average-case performance of certain greedy algorithms. These are derived from algorithms in which the possible operations performed at each step are prioritised. This type of prioritisation has occurred in previously studied heuristics for finding large subgraphs with special properties in random regular graphs, such as maximum independent sets and minimum dominating sets. The approach in this paper eliminates some of the complications caused by prioritisation. The main results apply in general to random graphs with a given degree sequence.
منابع مشابه
Independent Sets in Bounded-Degree Hypergraphs
In this paper we analyze several approaches to the Maximum Independent Set (MIS) problem in hypergraphs with degree bounded by a parameter ∆. Since independent sets in hypergraphs can be strong and weak, we denote by MIS (MSIS) the problem of finding a maximum weak (strong) independent set in hypergraphs, respectively. We propose a general technique that reduces the worst case analysis of certa...
متن کاملApproximate solution of length-bounded maximum multicommodity flow with unit edge-lengths
An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are proposed. Computational experiments are carried out on benchmark graphs and on graphs that model software defined satellite networks to compare the proposed algorithms and an exact linear programming solver. The results of...
متن کاملApproximation Algorithms for Independent Set Problems on Hypergraphs
This thesis deals with approximation algorithms for the Maximum Independent Set and the Minimum Hitting Set problems on hypergraphs. As a hypergraph is a generalization of a graph, the question is whether the best known approximations on graphs can be extended to hypergraphs. We consider greedy, local search and partitioning algorithms. We introduce a general technique, called shrinkage reducti...
متن کاملLight spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs
Grigni and Hung [10] conjectured that H-minor-free graphs have (1 + )-spanners that are light, that is, of weight g(|H|, ) times the weight of the minimum spanning tree for some function g. This conjecture implies the efficient polynomial-time approximation scheme (PTAS) of the traveling salesperson problem in H-minor free graphs; that is, a PTAS whose running time is of the form 2f( )nO(1) for...
متن کاملOn-line Multicasting in Directed Graphs Work in progress
In this paper we study the problem of on-line multicasting on directed graphs, and we demonstrate the competitiveness of a greedy algorithm in a worst case analysis. We prove that the greedy algorithm performs almost as well as any on-line algorithm: the greedy upper bound is very close to the lower bound of any on-line algorithm. First, we improve on the upper bound of the oo-line greedy algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 273 شماره
صفحات -
تاریخ انتشار 2003